Strong inequalities for capacitated survivable network design problems
نویسندگان
چکیده
We present several classes of facet-deening inequalities to strengthen polyhedra arising as subsystems of network design problems with survivability constraints. These problems typically involve assigning capacities to a network with multicommodity demands, such that after a vertex-or edge-deletion at least some prescribed fraction of each demand can be routed.
منابع مشابه
A Fast Strategy to Find Solution for Survivable Multicommodity Network
This paper proposes an immediately efficient method, based on Benders Decomposition (BD), for solving the survivable capacitated network design problem. This problem involves selecting a set of arcs for building a survivable network at a minimum cost and within a satisfied flow. The system is subject to failure and capacity restriction. To solve this problem, the BD was initially proposed with ...
متن کاملA directed cycle-based column-and-cut generation method for capacitated survivable network design
A network is said to be survivable if it has sufficient capacity for rerouting all of its flow under the failure of any one of its edges. Here we present a polyhedral approach for designing survivable networks. We describe a mixed–integer programming model, in which sufficient slack is explicitly introduced on the directed cycles of the network while flow routing decisions are made. In case of ...
متن کاملDesigning capacitated survivable networks: Polyhedral analysis and algorithms
Designing capacitated survivable networks: Polyhedral analysis and algorithms by Deepak Rajan Doctor of Philosophy in Engineering-Industrial Engineering and Operations Research University of California, Berkeley Professor Alper Atamtürk, Chair In this dissertation, we develop new methodologies and efficient algorithms to solve the capacitated survivable network design problem. Given the graph a...
متن کاملThe Multilayer Capacitated Survivable IP Network Design Problem : valid inequalities and Branch-and-Cut
Telecommunication networks can be seen as the stacking of several layers like, for instance, IPover-Optical networks. This infrastructure has to be sufficiently survivable to restore the traffic in the event of a failure. Moreover, it should have adequate capacities so that the demands can be routed between the origin-destinations. In this paper we consider the Multilayer Capacitated Survivable...
متن کاملCapacitated network design using general flow-cutset inequalities
This paper deals with directed, bidirected, and undirected capacitated network design problems. Using mixed integer rounding (MIR), we generalize flow-cutset inequalities to these three link types and to an arbitrary modular link capacity structure, and propose a generic separation algorithm. In an extensive computational study on 54 instances from the Survivable Network Design Library (SNDlib)...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Program.
دوره 89 شماره
صفحات -
تاریخ انتشار 2000